import java.util.ArrayList;

public class T {

    public static void main(String[] args) {
        int[] a=new int[10];

        System.out.println(a.length);
    }
}


class MyCircularQueue {
   int[] arr;
   int s=0;
   int e;
   int capacity;


   int len=0;

    public MyCircularQueue(int k) {

      arr=new int[k];
      capacity=k;
      e=k-1;

    }

    public boolean enQueue(int value) {
        if (len==capacity){
            return false;
        }


            e=(e+1)%capacity;
            arr[e]=value;
            len++;


        return true;

    }

    public boolean deQueue() {

        if(len==0){
            return false;
        }else {
            s=(s+1)%capacity;
            len--;
            return true;

        }

    }

    public int Front() {

        if(len==0){
            return -1;
        }else {

            return arr[s];

        }


    }

    public int Rear() {

        if(len==0){
            return -1;
        }

        return arr[e];

    }

    public boolean isEmpty() {

        return len==0;

    }

    public boolean isFull() {

        return len==capacity;

    }
}

/**
 * Your MyCircularQueue object will be instantiated and called as such:
 * MyCircularQueue obj = new MyCircularQueue(k);
 * boolean param_1 = obj.enQueue(value);
 * boolean param_2 = obj.deQueue();
 * int param_3 = obj.Front();
 * int param_4 = obj.Rear();
 * boolean param_5 = obj.isEmpty();
 * boolean param_6 = obj.isFull();
 */